Ch.3 Set Theory
Return to TOC
Set Theory
- set: collection of objects
- U is the set of "all" objects
- Notation: {list of all elements of set}, often named
- e.g. {a,e,i,o,u},N={1,2,3,...},{1,2,3,...,100}
- alternate: {description of universe ∣ condition}
- {n∈N ∣ n≤100}
- a∈A: a is in A; a∈A: a is not in A
Operations with Sets
- intersection∩: A∩B={a∈U ∣ a∈A∧a∈B}
- union∪: A∪B={a∈U ∣ a∈A∨a∈B}
- complimentXc: Ac={a∈U ∣ a∈A}
- difference∖: A∖B={a∈U ∣ a∈A∧a∈B}
- subset⊆: A⊆B={a∈U ∣ a∈A⟹a∈B}
Given sets X and Y:
Proving X⊆Y: check ∀a(a∈X⟹a∈Y)
Proving X=Y: check ∀a(a∈X⟺a∈Y)
U: "universe"- all sets A are subsets of U
∅: empty set- ∅⊆A for all A
P(A): power of a set- {S⊆U ∣ S⊆A}- "set of sets" (includes ∅ and A)
A×B: cartesian product of two sets- A×B={(a,b) ∣ a∈A∧b∈B}; is an ordered pair
Example 3.1
S={N,Q,R,Z}A={a,e,i,o,u}B={a,b,c}C={0,1}
- N⊆S→ false
- {∅,R}⊆S→ false
- {a,e,o}∈P(A)→ true
- B×C={(a,0),(a,1),(b,0),(b,1),(c,0),(c,1)}→ true
Example 3.2
Show that X∖Y=X∩Yc for any sets X and Y
Two approaches: check all elements of left are elements of right, then all elements of right are elements of left; or use a series of equivalent statements
First check X∖Y⊆X∩Yc
Take a∈X∖Y. By definition, a∈X∧A∈Y. By definition of compliment, a∈X∧A∈Yc. Finally, by definition of intersection, a∈X∩Yc
Next check X∩Yc⊆X∖Y (omitted)
Since they are by definition, we can go both ways with equivalent statements: a∈X∖Y⟺a∈X∧a∈Y by definition, therefore it goes both ways.